Complete graph

Results: 868



#Item
161Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Dense subgraph / Independent set / Planted clique / Clique / Dense graph / Hypergraph / Graph coloring / Subgraph isomorphism problem

JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:36
162Graph theory / Mathematics / NP-complete problems / Graph coloring / Line graph / Graph homomorphism / Approximately finite-dimensional C*-algebra / Orbifold

COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS ´n Alexander Barvinok and Pablo Sobero May 2015

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2015-05-01 16:21:13
163Graph theory / Mathematics / NP-complete problems / Spanning tree / Edsger W. Dijkstra / Routing algorithms / Search algorithms / Topology control / Unit disk graph / Connectivity / Minimum spanning tree / Bipartite graph

XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger {wattenhofer, zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich 8092 Zurich, Switzerland

Add to Reading List

Source URL: disco.ethz.ch

Language: English
164Graph theory / Procedural generation / Cycle / Graph coloring / NP-complete problems / Book:Graph Theory

Constrained Level Generation through Grammar-Based Evolutionary Algorithms Jose M. Font*1 , Roberto Izquierdo2 , Daniel Manrique2 , and Julian Togelius3 1 U-tad, Centro Universitario de Tecnolog´ıa y Arte Digital, C/P

Add to Reading List

Source URL: julian.togelius.com

Language: English - Date: 2016-03-20 21:33:21
165Cluster analysis / Data mining / Geostatistics / Graph operations / Planar graphs / NP-complete problems / HCS clustering algorithm

Storytelling and Clustering for Cellular Signaling Pathways M. Shahriar Hossain, Monika Akbar, Nicholas F. Polys Department of Computer Science, Virginia Tech, Blacksburg, VA 24061, USA. {msh, amonika, npolys}@vt.edu ABS

Add to Reading List

Source URL: www.cs.utep.edu

Language: English - Date: 2010-09-07 10:56:06
166Graph theory / Mathematics / Expander graph / Balls into bins / NP-complete problems / Quiver / Eternal dominating set

Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:50
167Graph theory / Mathematics / Discrete mathematics / Graph coloring / NP-complete problems / Vertex / Neighbourhood / Distance

SYNC or ASYNC: Time to Fuse for Distributed Graph-Parallel Computation Chenning Xie† Rong Chen†

Add to Reading List

Source URL: ipads.se.sjtu.edu.cn

Language: English - Date: 2014-12-16 04:16:53
168Graph theory / Mathematics / Combinatorial optimization / Edsger W. Dijkstra / Routing algorithms / Search algorithms / NP-complete problems / Graph traversal / Shortest path problem / Matching / A* search algorithm / Planar graph

Lower and Upper Competitive Bounds for Online Directed Graph ExplorationI Klaus-Tycho Foerstera,1,∗, Roger Wattenhofera a ETH Z¨

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-02-08 07:16:33
169Graph theory / Mathematics / Computational complexity theory / Spanning tree / NP-complete problems / Dominating set / Minimum spanning tree / Maximal independent set / Matching / Travelling salesman problem / Shortest path problem / Tree

Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:16
170Mathematics / Graph theory / Discrete mathematics / NP-complete problems / Combinatorics / Partition of a set / Planar separator theorem / Graph coloring

JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:35
UPDATE